On Tiling as a Loop Transformation
نویسنده
چکیده
Jingling Xue Department of Mathematics, Statistics and Computing Science University of New England, Armidale 2351, Australia ABSTRACT This paper is a follow-up to Irigoin and Triolet's earlier work and our recent work on tiling. In this paper, tiling is discussed in terms of its e ects on the dependences between tiles, the dependenceswithin a tile and the required dependence test for legality. A necessary and su cient condition is given for enforcing the data dependences of the program,while Irigoin and Triolet's atomic tile constraint is only su cient. A condition is identi ed under which both Irigoin and Triolet's and our constraints are equivalent. The results of this paper are discussed in terms of their impact on dependence abstractions suitable for legality test and on tiling to optimise a certain given goal.
منابع مشابه
A Unifying Framework for Iteration Reordering Transformations
We present a framework for unifying iteration reordering transformations such as loop interchange, loop distribution, skewing, tiling, index set splitting and statement reordering. The framework is based on the idea that a transformation can be represented as a mapping from the original iteration space to a new iteration space. The framework is designed to provide a uniform way to represent and...
متن کاملAdapting Fourier-Motzkin Elimination to Compute Bounds in Multilevel Tiling
This work focuses on the complexity of computing exact loop bounds in Multilevel Tiling. Conventional tiling techniques implement tiling using first strip-mining and afterwards loop interchange. Multilevel tiling has typically been implemented applying tiling level by level. We present a new way to implement Multilevel Tiling that deals with all levels simultaneously, performing a loop intercha...
متن کاملOn the Scalability of Loop Tiling Techniques
The Polyhedral model has proven to be a valuable tool for improving memory locality and exploiting parallelism for optimizing dense array codes. This model is expressive enough to describe transformations of imperfectly nested loops, and to capture a variety of program transformations, including many approaches to loop tiling. Tools such as the highly successful PLuTo automatic parallelizer hav...
متن کاملPrimeTile: A Parametric Multi-Level Tiler for Imperfect Loop Nests
Tiling is a crucial loop transformation for generating high performance code on modern architectures. Efficient generation of multi-level tiled code is essential for maximizing data reuse in systems with deep memory hierarchies. Tiled loops with parametric tile sizes (not compile-time constants) facilitate runtime feedback and dynamic optimizations used in iterative compilation and automatic tu...
متن کاملNear-Optimal Loop Tiling by Means of Cache Miss Equations and Genetic Algorithms
The effectiveness of the memory hierarchy is critical for the performance of current processors. The performance of the memory hierarchy can be improved by means of program transformations such as loop tiling, which is a code transformation targeted to reduce capacity misses. This paper presents a novel systematic approach to perform nearoptimal loop tiling based on an accurate data locality an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 7 شماره
صفحات -
تاریخ انتشار 1997